翻訳と辞書 Words near each other ・ Blumfeld, an Elderly Bachelor ・ Blumfield ・ Blumfield Township, Michigan ・ Blumhardt ・ Blumhouse Productions ・ Blumine ・ Blumine Island ・ Blumio ・ Blumlein ・ Blumlein Pair ・ Blumond ・ Blumpkin ・ Blumsky ・ Blum–Byrnes agreement ・ Blum–Goldwasser cryptosystem ・ Blum–Micali algorithm ・ Blum–Shub–Smale machine ・ Bluna ・ Blunaki ・ Blundell ・ Blundell (1812 cricketer) ・ Blundell Park ・ Blundell Peak ・ Blundell's School ・ Blundells Cottage ・ Blundellsands ・ Blundellsands & Crosby railway station ・ Blundellsands (ward) ・ Blunden ・ Blunden baronets Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Blum–Micali algorithm ： ウィキペディア英語版 Blum–Micali algorithm The ''Blum–Micali algorithm'' is a cryptographically secure pseudorandom number generator. The algorithm gets its security from the difficulty of computing discrete logarithms.〔Bruce Schneier, ''Applied Cryptography: Protocols, Algorithms, and Source Code in C'', pages 416-417, Wiley; 2nd edition (October 18, 1996), ISBN 0471117099〕 Let $p$ be an odd prime, and let $g$ be a primitive root modulo $p$. Let $x\_0$ be a seed, and let $x\_\; =\; g^\backslash \; \backslash bmod$. The $i$th output of the algorithm is 1 if . Otherwise the output is 0. This is equivalent to using one bit of $x\_i$ as your random number. It has been shown that $n\; -\; c\; -\; 1$ bits of $x\_i$ can be used if solving the discrete log problem is infeasible even for exponents with as few as $c$ bits.〔An improved pseudo-random generator based on the discrete logarithm problem R Gennaro - Journal of Cryptology, 2005 - Springer〕 In order for this generator to be secure, the prime number $p$ needs to be large enough so that computing discrete logarithms modulo $p$ is infeasible.〔 To be more precise, any method that predicts the numbers generated will lead to an algorithm that solves the discrete logarithm problem for that prime.〔Manuel Blum and Silvio Micali, ''How to Generate Cryptographically Strong Sequences of Pseudorandom Bits,'' SIAM Journal on Computing 13, no. 4 (1984): 850-864. (online (pdf) )〕 There is a paper discussing possible examples of the quantum permanent compromise attack to the Blum-Micali construction. This attacks illustrate how a previous attack to the Blum-Micali generator can be extended to the whole Blum-Micali construction, including the Blum Blum Shub and Kaliski generators.〔Elloá B. Guedes, Francisco Marcos de Assis, Bernardo Lula Jr, Examples of the Generalized Quantum Permanent Compromise Attack to the Blum-Micali Construction http://arxiv.org/abs/1012.1776〕 == References == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Blum–Micali algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.